New hardware-efficient algorithm and architecture for the computation of 2-D DCT on a linear systoli - Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference o
نویسندگان
چکیده
A new recursive algorithm for fast computation of twodimensional discrete cosine transforms (2-D DCT) is derived by converting the 2-D data matrices into 1-D vectors and then using different partition methods for the time and frequency indices. The algorithm first computes the 2-D complex DCT (2-D CCT) and then produces two 2-D DCT outputs simultaneously through a post-addition step. The decomposed form of the 2-D recursive algorithm looks very like a radix-4 FFT algorithm and is in particular suitable for VLSI implementation since the common entries in each row of the butterfly-like matrix are factored out in order to reduce the number of multipliers. A new linear systolic architecture is presented which leads to a hardware-efficient architectural design requiring only logN multipliers plus 3logN adderdsubtractors for the computation of two N x N DCTs.
منابع مشابه
Field of the Invention
DATA DETECTION Kiyoshi Yokota, et al. in "A New Missing ATM Cell Reconstruction Scheme for ADPCM-Coded Speech', Pro ceedings of the International Conference of Acoustics, Speech, and Signal Processing 1989. Cointot and G. de PassoZ in "A 60-Channel PCM-ADPCM Converter Robust to Channel Errors', Proceedings of the International Conference of Acoustics, Speech, and Signal Processing 1982. D. Kim ...
متن کاملA refined fast 2-D discrete cosine transform algorithm
In this paper, a fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N Npoint l-D DCT’s and some postadditions are required for the computation of an (?JxN)-point 2-D DCT. Furthermore, as compared with [7], the derivation of the refined algorithm is more succinct, and the associated po...
متن کاملRestructured recursive DCT and DST algorithms
The discrete cosine transform (DCT) and the discrete sine transform (DST) have found wide applications in speech and image processing, as well as telecommunication signal processing for the purpose of data compression, feature extraction, image reconstruction, and ltering. In this paper, we present new recursive algorithms for the DCT and the DST. The proposed method is based on certain recursi...
متن کاملAlgorithms for Independent Low-Rank Matrix Analysis
This document summarizes an algorithm for independent low-rank matrix analysis, which was proposed as determined rank-1 multichannel nonnegative matrix factorization in the following published papers: Daichi Kitamura, Nobutaka Ono, Hiroshi Sawada, Hirokazu Kameoka, and Hiroshi Saruwatari, “Efficient multichannel nonnegative matrix factorization exploiting rank-1 spatial model,” Proceedings of I...
متن کاملGeometric microphone array calibration by multidimensional scaling
Classical multidimensional scaling is a simple, linear technique for finding coordinates of points given their interpoint distances. In this paper we describe the algorithm and show how it can be used to solve the geometric microphone array calibration problem. The method requires no complicated hardware or calibration targets, just a tape measure (or similar measuring device). We also extend t...
متن کامل